Cubetree: Organization of and Bulk Incremental Updates on the Data Cube
نویسندگان
چکیده
The data cube is an aggregate operator which has been shown to be very powerful for On Line Analytical Processing (OLAP) in the context of data warehousing. It is, however, very expensive to compute, access, and maintain. In this paper we de ne the \cubetree" as a storage abstraction of the cube and realize it using packed R-trees for most e cient cube queries. We then reduce the problem of creation and maintenance of the cube to sorting and bulk incremental merge-packing of cubetrees. This merge-pack has been implemented to use separate storage for writing the updated cubetrees, therefore allowing cube queries to continue even during maintenance. Finally, we characterize the size of the delta increment for achieving good bulk update schedules for the cube. The paper includes experiments with various data sets measuring query and bulk update performance.
منابع مشابه
Efficient Execution of Range-Aggregate Queries in Data Warehouse Environments
Range-aggregate queries on the data cube are powerful tools for analysis in data warehouse environments. Cubetree is a technique materializing a data cube through an R-tree. It provides efficient data accessibility, but involves some drawbacks to traverse all the internal and leaf nodes within given query ranges to compute range-aggregate queries. In this paper, we propose a novel index structu...
متن کاملThe DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and applied to the data warehouse periodically in a batch mode, e.g., over night. Then, all derived information such as index structures has to be updated as well. The standard approach of bulk incremental updates to data wareh...
متن کاملThe Cubetree Storage Organization
The Relational On-Line Analytical Processing (ROLAP) is emerging as the dominant approach in data warehousing. In order to enhance query performance, the ROLAP approach relies on selecting and materializing in summary tables appropriate subsets of aggregate views which are then engaged in speeding up OLAP queries. However, a straight forward relational storage implementation of materialized ROL...
متن کاملAg-tree: an Index Structure for Range-aggregation Queries in Data Warehouse Environments
Range-aggregate queries are popular in many applications in data warehouse environments with large business relational databases. To evaluate these efficiently, several studies on data cubes (such as the aggregate cubetree) have been carried out. In the wellknown aggregate cubetree, each entry in every node stores the aggregate values of its corresponding subtree. Therefore, range-aggregate que...
متن کاملComparative Evaluation of microleakage of Bulk-fill and Posterior Composite Resins Using the Incremental Technique and a Liner in Cl II Restorations
Background and Aim: In recent years there has been a surge in the use of tooth-colored restorations. However, the polymerization shrinkage of these materials can form gaps, resulting in microleakage. This study aimed to compare microleakage by using different materials and techniques. Materials and Methods: In this experimental study, Cl II cavities were prepared on the mesial surfaces of 60 s...
متن کامل